4 research outputs found

    The depth and the attracting centre for a continuous map on a fuzzy metric interval

    Full text link
    [EN] Let I be a fuzzy metric interval and f be a continuous map from I to I. Denote by R(f), Ω(f) and ω(x, f) the set of recurrent points of f, the set of non-wandering points of f and the set of ω- limit points of x under f, respectively. Write ω(f) = ∪x∈Iω(x, f), ωn+1(f) = ∪x∈ωn(f)ω(x, f) and Ωn+1(f) = Ω(f|Ωn(f)) for any positive integer n. In this paper, we show that Ω2(f) = R(f) and the depth of f is at most 2, and ω3(f) = ω2(f) and the depth of the attracting centre of f is at most 2.Project supported by NNSF of China (11761011, 71862003) and NSF of Guangxi (2018GXNSFAA294010) and SF of Guangxi University of Finance and Economics (2019QNB10).Sun, T.; Li, L.; Su, G.; Han, C.; Xia, G. (2020). The depth and the attracting centre for a continuous map on a fuzzy metric interval. Applied General Topology. 21(2):285-294. https://doi.org/10.4995/agt.2020.13126OJS285294212A. George and P. Veeramani, On some results in fuzzy metric spaces, Fuzzy Sets Sys. 64 (1994), 395-399. https://doi.org/10.1016/0165-0114(94)90162-7M. Grabiec, Fixed points in fuzzy metric spaces, Fuzzy Sets Sys. 27 (1989), 385-389. https://doi.org/10.1016/0165-0114(88)90064-4V. Gregori and J. J. Miñana, Some remarks on fuzzy contractive mappings, Fuzzy Sets Sys. 251 (2014), 101-103. https://doi.org/10.1016/j.fss.2014.01.002V. Gregori and J. J. Miñana, On fuzzy Ψ-contractive sequences and fixed point theorems, Fuzzy Sets Sys. 300 (2016), 93-101. https://doi.org/10.1016/j.fss.2015.12.010V. Gregori and A. Sapena, On fixed-point theorems in fuzzy metric spaces, Fuzzy Sets Sys. 125 (2002), 245-252. https://doi.org/10.1016/S0165-0114(00)00088-9X. Hu, Z. Mo and Y. Zhen, On compactnesses of fuzzy metric spaces (Chinese), J. Sichuan Norm. Univer. (Natur. Sei.) 32 (2009), 184-187.I. Kramosil and J. Michalek, Fuzzy metrics and statistical metric spaces, Kybernetika 11 (1975), 336-344.C. Li and Y. Zhang, On connectedness of the Hausdorff fuzzy metric spaces, Italian J. Pure Appl. Math. 42 (2019), 458-466.D. Mihet, Fuzzy Ψ-contractive mappings in non-Archimedean fuzzy metric spaces, Fuzzy Sets Sys. 159 (2008), 739-744. https://doi.org/10.1016/j.fss.2007.07.006D. Mihet, A note on fuzzy contractive mappings in fuzzy metric spaces, Fuzzy Sets Sys. 251 (2014), 83-91. https://doi.org/10.1016/j.fss.2014.04.010J. Rodríguez-López and S. Romaguera, The Hausdorff fuzzy metric on compact sets, Fuzzy Sets Sys. 147 (2004), 273-283. https://doi.org/10.1016/j.fss.2003.09.007B. Schweizer and A. Sklar, Statistical metrics paces, Pacif. J. Math. 10 (1960), 385-389. https://doi.org/10.2140/pjm.1960.10.313Y. Shen, D. Qiu and W. Chen, Fixed point theorems in fuzzy metric spaces, Appl. Math. Letters 25 (2012), 138-141. https://doi.org/10.1016/j.aml.2011.08.002D. Wardowski, Fuzzy contractive mappings and fixed points in fuzzy metric spaces, Fuzzy Sets Sys. 222 (2013), 108-114. https://doi.org/10.1016/j.fss.2013.01.012D. Zheng and P. Wang, On probabilistic Ψ-contractions in Menger probabilistic metric spaces, Fuzzy Sets Sys. 350 (2018), 107-110. https://doi.org/10.1016/j.fss.2018.02.011D. Zheng and P. Wang, Meir-Keeler theorems in fuzzy metric spaces, Fuzzy Sets Sys. 370 (2019), 120-128. https://doi.org/10.1016/j.fss.2018.08.01

    A Dynamically Adjusted Subspace Gradient Method and Its Application in Image Restoration

    No full text
    In this paper, a new subspace gradient method is proposed in which the search direction is determined by solving an approximate quadratic model in which a simple symmetric matrix is used to estimate the Hessian matrix in a three-dimensional subspace. The obtained algorithm has the ability to automatically adjust the search direction according to the feedback from experiments. Under some mild assumptions, we use the generalized line search with non-monotonicity to obtain remarkable results, which not only establishes the global convergence of the algorithm for general functions, but also R-linear convergence for uniformly convex functions is further proved. The numerical performance for both the traditional test functions and image restoration problems show that the proposed algorithm is efficient
    corecore